#include<bits/stdc++.h>
using namespace std;

#define int long long

int n, res, v[100010];
vector<int> w;

signed main(){
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    cin >> n;
    for(int i = 1; i <= n; i++)
        cin >> v[i];
    sort(v + 1, v + n + 1);
    for(int i = 1; i <= n; ){
        int j = i;
        while(j <= n && v[j] == v[i])
            j++;
        w.push_back(j - i), i = j;
        res = max(res, w.back());
    }
    cout << res << endl;
    return 0;
}